Minimum entropy coloring

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Entropy Coloring

We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of a coloring is called the chromatic entropy and was shown by Alon and Orlitsky (1996) to play a fundamental role in the problem of coding with side information. In this paper, we consider the minimum entropy coloring problem fr...

متن کامل

The Probabilistic Minimum Coloring Problem

Nous étudions le problème de coloration probabiliste (PCOLOR) sous une stratégie de modification consistant, pour une solution a priori C, de supprimer les sommets qui son absents de C. Nous calculons la fonction objectif associée avec cette stratégie, donnons des bornes pour sa valeur et caractérisons la complexité algorithmique du calcul de la solution a priori optimal. Nous démontrons que PC...

متن کامل

Minimum entropy orientations

We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy set cover problem previously studied by Halperin and Karp (Theoret. Comput. Sci., 2005) and by the current authors (Algorithmica, to appear). We prove that the minimum entropy orientation problem is NP-hard even if the ...

متن کامل

On Minimum Entropy Segmentation

We describe segmented multiresolution analyses of [0; 1]. Such multiresolution analyses lead to segmented wavelet bases which are adapted to discontinuities, cusps, etc., at a given location 2 [0; 1]. Our approach emphasizes the idea of average-interpolation { synthesizing a smooth function on the line having prescribed boxcar averages. This particular approach leads to methods with subpixel re...

متن کامل

The Minimum Entropy Network

Some researchers in pattem recognition theory claim thal for pattem recognition and classification dustering Iransfonnations are needed which reduce the intra-class entropy. This is implemented for Gaussian sources by a linear transfonnation using the eigenvectors with the smallest eigenvalues. This paper shows thal using ru basic building block a linear neuron with an Anti-Hebb rule and restri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Optimization

سال: 2008

ISSN: 1382-6905,1573-2886

DOI: 10.1007/s10878-008-9152-2